Approximate nearest neighbor search for $\ell_p$-spaces ($2<p<\infty$) via embeddings
نویسندگان
چکیده
While the problem of approximate nearest neighbor search has been well-studied for Eu-clidean space and ℓ 1 , few non-trivial algorithms are known for ℓ p when 2 < p < ∞. In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting.
منابع مشابه
Dimension reduction techniques for $\ell_p$, $1 \le p \le 2$, with applications
For ℓ 2 , there exists the powerful dimension reduction transform of Johnson and Lindenstrauss [JL84], with a host of known applications. Here, we consider the problem of dimension reduction for all ℓ p spaces 1 ≤ p < ∞. Although strong lower bounds are known for dimension reduction in ℓ 1 , Ostrovsky and Rabani [OR02] successfully circumvented these by presenting an ℓ 1 embedding that maintain...
متن کاملApproximate Nearest Neighbor Search in $\ell_p$
We present a new locality sensitive hashing (LSH) algorithm for c-approximate nearest neighbor search in lp with 1 < p < 2. For a database of n points in lp, we achieve O(dn ) query time and O(dn + n) space, where ρ ≤ O((ln c)/c). This improves upon the previous best upper bound ρ ≤ 1/c by Datar et al. (SOCG 2004), and is close to the lower bound ρ ≥ 1/c by O’Donnell, Wu and Zhou (ITCS 2011). T...
متن کاملΕ-isa: an Incremental Lower Bound Approach for Efficiently Finding Approximate Nearest Neighbor of Complex Vague Queries
In our context, a complex vague query means a multifeature nearest neighbor query. Answering such queries requires the system to search on some feature spaces individually and then combine the searching results to find the final answers. The feature spaces are commonly multidimensional spaces and may consist of a vast amount of data. Therefore searching costs, including IO-cost and CPU-cost, ar...
متن کاملA Class of Hereditarily $ell_p(c_0)$ Banach spaces
We extend the class of Banach sequence spaces constructed by Ledari, as presented in ''A class of hereditarily $ell_1$ Banach spaces without Schur property'' and obtain a new class of hereditarily $ell_p(c_0)$ Banach spaces for $1leq p<infty$. Some other properties of this spaces are studied.
متن کاملFast Nearest Neighbor Preserving Embeddings
We show an analog to the Fast Johnson-Lindenstrauss Transform for Nearest Neighbor Preserving Embeddings in `2. These are sparse, randomized embeddings that preserve the (approximate) nearest neighbors. The dimensionality of the embedding space is bounded not by the size of the embedded set n, but by its doubling dimension λ. For most large real-world datasets this will mean a considerably lowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015